Activity Recognition with Multi-tape Fuzzy Finite Automata
نویسنده
چکیده
Recognizing the activities performed by the user in an unobtrusive manner is one of the important requisites of pervasive computing. Users perform a number of activities during their day to day life. Tracking and deciding what a user is doing at a given time involves a number of challenges. The lack of a precise pattern in doing an activity at different times is one among them. The number, order, and duration of the different steps involved in an activity vary significantly, even when the activity is done by the same user at different times. To overcome these challenges, a number of simultaneous inputs have to be handled with provisions for handling variations in number, order and duration of these inputs. This paper explains how multitape fuzzy finite state automata can be used to effectively recognize human activities. The method explained is found to give good results when tested using publicly available activity datasets collected in a smart home environment. Index Terms — Pervasive Computing, Activity Recognition, Fuzzy Automata
منابع مشابه
A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملRevisiting Multi-Tape Automata for Semitic Morphological Analysis and Generation
Various methods have been devised to produce morphological analyzers and generators for Semitic languages, ranging from methods based on widely used finitestate technologies to very specific solutions designed for a specific language or problem. Since the earliest proposals of how to adopt the elsewhere successful finite-state methods to root-andpattern morphologies, the solution of encoding Se...
متن کاملAsynchronous Multi-Tape Automata Intersection: Undecidability and Approximation
When their reading heads are allowed to move completely asynchronously, finite-state automata with multiple tapes achieve a significant expressive power, but also lose useful closure properties—closure under intersection, in particular. This paper investigates to what extent it is still feasible to use multi-tape automata as recognizers of polyadic predicates on words. On the negative side, det...
متن کاملMulti-head Watson-Crick automata
Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce a new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of ...
متن کاملNEW DIRECTION IN FUZZY TREE AUTOMATA
In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...
متن کامل